A First Course in Probability: Foundations of Experiments: Sample Spaces and Events

Probability theory isn't just about gambling; it's the mathematical formalization of uncertainty. It begins with the Experiment. Every experiment has a Sample Space ($S$), which is the exhaustive set of all possible outcomes. Think of $S$ as the "Universal Set" for your specific context. From this universe, we carve out Events ($E$)—subsets that represent specific conditions or results we are interested in. This transition from physical phenomena into the language of set theory is what allows us to apply rigorous mathematical tools to real-world chaos.

The Universal Set of Outcomes ($S$)

The sample space must be defined such that every performance of the experiment results in exactly one outcome $\omega \in S$. We distinguish between different structures of $S$ based on the experimental design:

Discrete Finite: Tossing coins or identifying a child's sex. Example 1: For a newborn, $S = \{g, b\}$.
Discrete Infinite (Countable): Counting how many attempts it takes to succeed at a task.
Continuous: Measuring the lifespan of an electronic component. $S = \{x: 0 \le x < \infty\}$.

Defining Events ($E$)

An Event is simply a subset of the sample space ($E \subseteq S$). An event is said to "occur" if the actual outcome of the experiment is an element of $E$. For example, if $S$ is the set of outcomes for tossing two dice, then the event "rolling a sum of 7" is a specific subset of ordered pairs.

Complexity Variance

Example 2: In a horse race with 7 participants, $S$ represents all $7!$ permutations (5,040 possible orders of finish). Here, $S = \{\text{all } 7! \text{ permutations of } (1, 2, 3, 4, 5, 6, 7)\}$.

Example 3: Flipping two coins results in four points: $S = \{(H, H), (H, T), (T, H), (T, T)\}$.

Example 4: Tossing two dice results in a 6x6 grid of 36 distinct points: $S = \{(i, j): i, j = 1, 2, 3, 4, 5, 6\}$.

Methodological Nuance: Replacement

The structure of $S$ is heavily influenced by the sampling method:

Sampling with replacement: The set of available choices remains constant across trials (e.g., pulling a card, recording it, and putting it back).
Sampling without replacement: Each selection alters the space of subsequent outcomes (e.g., dealing a hand of poker).

🎯 Core Principle

The sample space $S$ is the foundation. Every outcome is an element of $S$, and every event $E$ is a part of $S$. Whether the space is binary or an infinite continuum determines the tools we use to measure its probability.

QUESTION 1

A cafeteria offers a meal: Entree (Chicken or Beef), Starch (Pasta, rice, or potatoes), and Dessert (Ice cream, Jello, apple pie, or peach). How many outcomes are in the sample space $S$?

QUESTION 2

Consider an experiment with a countably infinite sample space. Which statement is true regarding the likelihood of points?

All points can be equally likely.

Not all points can be equally likely.

All points must have zero probability.

The sample space cannot exist.

QUESTION 3

Which of the following represents a continuous sample space?

Tossing a coin until heads appears.

The number of goals in a soccer match.

The time until a lightbulb burns out.

The order of finish in a 100m sprint.

QUESTION 4

An event $E$ is said to occur if:

The outcome is outside of $S$.

The outcome is an element of the subset $E$.

The outcome is the empty set.

The outcome is equal to the sample space $S$.

QUESTION 5

If an experiment consists of flipping two coins, how many points are in the sample space $S$?

Advanced Combinatorial Challenges

Sample Space Applications & Set Theory

Explore the boundaries of probability by solving these foundational problems involving inclusion-exclusion, permutations, and set inequalities.

EXAMPLE 5l: A club has 36 tennis players, 28 squash players, and 18 badminton players. 22 play tennis/squash, 12 play tennis/badminton, 9 play squash/badminton, and 4 play all three. How many members play at least one sport?

Using the Inclusion-Exclusion Principle for three sets $T, S, B$: $|T \cup S \cup B| = |T| + |S| + |B| - (|T \cap S| + |T \cap B| + |S \cap B|) + |T \cap S \cap B|$ $|T \cup S \cup B| = 36 + 28 + 18 - (22 + 12 + 9) + 4 = 82 - 43 + 4 = 43$ members.

EXAMPLE 5d: At a party, $n$ men randomly select mixed-up hats. A match occurs if a man picks his own. Find the probability of (a) no matches, (b) exactly $k$ matches.

(a) Probability of no matches (Derangement): $P(\text{no match}) = \sum_{i=0}^{n} \frac{(-1)^i}{i!}$. For large $n$, this is $\approx e^{-1} \approx 0.3678$. (b) Probability of exactly $k$ matches: $P(\text{exactly } k) = \frac{\binom{n}{k} \times D_{n-k}}{n!} = \frac{1}{k!} \sum_{i=0}^{n-k} \frac{(-1)^i}{i!}$.

EXAMPLE 5h: In Bridge (52 cards to 4 players), what is the probability that (a) one player receives all 13 spades; (b) each player receives 1 ace?

(a) Any of 4 players can get all 13 spades: $P = \frac{4 \binom{39}{13, 13, 13}}{\binom{52}{13, 13, 13, 13}} = \frac{4}{\binom{52}{13}} \approx 6.3 \times 10^{-12}$. (b) Permuting aces among players: $P = \frac{4! \binom{48}{12, 12, 12, 12}}{\binom{52}{13, 13, 13, 13}} \approx 0.1055$.

Prove Boole's inequality: $P(\cup_{i=1}^{\infty} A_i) \leq \sum_{i=1}^{\infty} P(A_i)$.

Define $B_1 = A_1$, $B_2 = A_2 \setminus A_1$, and generally $B_n = A_n \setminus (\cup_{i=1}^{n-1} A_i)$. The $B_i$ are disjoint and $\cup A_i = \cup B_i$. Since $B_i \subseteq A_i$, then $P(B_i) \leq P(A_i)$. By Axiom 3: $P(\cup A_i) = P(\cup B_i) = \sum P(B_i) \leq \sum P(A_i)$.